Numerically Stable Real Number Codes Based on Random Matrices
نویسندگان
چکیده
Error correction codes defined over realnumber and complex-number fields have been studied and recognized as useful in many applications. However, most real-number and complex-number codes in literature are quite suspect in their numerical stability. In this paper, we introduce a class of numerically stable real-number and complex-number codes that are based on random generator matrices over real-number and complex-number fields.
منابع مشابه
Numerically stable cointegration analysis
Cointegration analysis involves the solution of a generalized eigenproblem involving moment matrices and inverted moment matrices. These formulae are unsuitable for actual computations because the condition numbers of the resulting matrices are unnecessarily increased. Our note discusses how to use the structure of the problem to achieve numerically stable computations, based on QR and singular...
متن کاملMatrices With Small Coherence Using $p$-Ary Block Codes
In contrast to the vast amount of literature in random matrices in the field of compressed sensing, the subject of deterministic matrix design is at its early stages. Since these deterministic matrices are usually constructed using the polynomials in finite Galois fields, the number of rows (number of samples) is restricted to some specific integers such as prime powers. In this paper, besides ...
متن کاملSparks and Deterministic Constructions of Binary Measurement Matrices from Finite Geometry
For a measurement matrix in compressed sensing, its spark (or the smallest number of columns that are linearly dependent) is an important performance parameter. The matrix with spark greater than 2k guarantees the exact recovery of ksparse signals under an l0-optimization, and the one with large spark may perform well under approximate algorithms of the l0-optimization. Recently, Dimakis, Smara...
متن کاملA fast structure-preserving method for computing the singular value decomposition of quaternion matrices
In this paper we propose a fast structure-preserving algorithm for computing the singular value decomposition of quaternion matrices. The algorithm is based on the structurepreserving bidiagonalization of the real counterpart for quaternion matrices by applying orthogonal JRS-symplectic matrices. The algorithm is efficient and numerically stable. 2014 Elsevier Inc. All rights reserved.
متن کاملProbability of Local Bifurcation Type from a Fixed Point: A Random Matrix Perspective
Results regarding probable bifurcations from fixed points are presented in the context of general dynamical systems (real, random matrices), time-delay dynamical systems (companion matrices), and a set of mappings known for their properties as universal approximators (neural networks). The eigenvalue spectrum is considered both numerically and analytically using previous work of Edelman et al. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005